Classical Verification of Quantum Computations - QIP 2019 Keynote | NextBigFuture.com

Is it possible for an efficient classical verifier (a BPP machine) to verify the output of an efficient quantum prover (a BQP machine)? The answer is Yes. Researchers show that a classical polynomial time verifier (a BPP machine) can interact with an efficient quantum prover (a BQP machine) in order to verify BQP computations. They rely on the additional assumption that the verifier may use post-quantum cryptography that the BQP prover cannot break. They rely on quantum secure classical encryption schemes, such as those based on the learning with errors problem. These schemes can be used to encrypt classical bits